|
In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. In another way, it measures the minimum number of ''substitutions'' required to change one string into the other, or the minimum number of ''errors'' that could have transformed one string into the other. A major application is in coding theory, more specifically to block codes, in which the equal-length strings are vectors over a finite field. ==Examples== The Hamming distance between: * "karolin" and "kathrin" is 3. * "karolin" and "kerstin" is 3. * 1011101 and 1001001 is 2. * 2173896 and 2233796 is 3. On a two-dimensional grid such as a chessboard, the Hamming distance is the minimum number of moves it would take a rook to move from one cell to the other. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「hamming distance」の詳細全文を読む スポンサード リンク
|